Accelerating adaptive inverse distance weighting interpolation algorithm on a graphics processing unit

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating adaptive inverse distance weighting interpolation algorithm on a graphics processing unit

This paper focuses on designing and implementing parallel adaptive inverse distance weighting (AIDW) interpolation algorithms by using the graphics processing unit (GPU). The AIDW is an improved version of the standard IDW, which can adaptively determine the power parameter according to the data points' spatial distribution pattern and achieve more accurate predictions than those predicted by I...

متن کامل

Spatial Interpolation via Inverse Path Distance Weighting

The R package ipdw provides functions for interpolation of georeferenced point data via Inverse Path Distance Weighting. Useful for coastal marine applications where barriers in the landscape preclude interpolation with Euclidean distances. This method of interpolation requires significant computation and is only practical for relatively small and coarse grids. The ipdw implementation may provi...

متن کامل

Accelerating Wright–Fisher Forward Simulations on the Graphics Processing Unit

Forward Wright-Fisher simulations are powerful in their ability to model complex demography and selection scenarios, but suffer from slow execution on the Central Processor Unit (CPU), thus limiting their usefulness. However, the single-locus Wright-Fisher forward algorithm is exceedingly parallelizable, with many steps that are so-called "embarrassingly parallel," consisting of a vast number o...

متن کامل

Accelerating Molecular Dynamics Simulation Using Graphics Processing Unit

We have developed CUDA-enabled version of a general purpose molecular dynamics simulation code for GPU. Implementation details including parallelization scheme and performance optimization are described. Here we have focused on the non-bonded force calculation because it is most time consuming part in molecular dynamics simulation. Timing results using CUDA-enabled and CPU versions were obtaine...

متن کامل

Genetic Algorithm on General Purpose Graphics Processing Unit: Parallelism Review

Genetic Algorithm (GA) is effective and robust method for solving many optimization problems. However, it may take more runs (iterations) and time to get optimal solution. The execution time to find the optimal solution also depends upon the niching-technique applied to evolving population. This paper provides the information about how various authors, researchers, scientists have implemented G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Royal Society Open Science

سال: 2017

ISSN: 2054-5703

DOI: 10.1098/rsos.170436